Pre-convolved Radiance Caching
نویسندگان
چکیده
The incident indirect light over a range of image pixels is often coherent. Two common approaches to exploit this inter-pixel coherence to improve rendering performance are Irradiance Caching and Radiance Caching. Both compute incident indirect light only for a small subset of pixels (the cache), and later interpolate between pixels. Irradiance Caching uses scalar values that can be interpolated efficiently, but cannot account for shading variations caused by normal and reflectance variation between cache items. Radiance Caching maintains directional information, e. g., to allow highlights between cache items, but at the cost of storing and evaluating a Spherical Harmonics (SH) function per pixel. The arithmetic and bandwidth cost for this evaluation is linear in the number of coefficients and can be substantial. In this paper, we propose a method to replace it by an efficient per-cache item pre-filtering based on MIP maps — such as previously done for environment maps — leading to a single constant-time lookup per pixel. Additionally, per-cache item geometry statistics stored in distance-MIP maps are used to improve the quality of each pixel’s lookup. Our approximate interactive global illumination approach is an order of magnitude faster than Radiance Caching with Phong BRDFs and can be combined with Monte Carlo-raytracing, Point-based Global Illumination or Instant Radiosity.
منابع مشابه
Clustered Pre-convolved Radiance Caching
We present a scalable method for rendering indirect illumination in diffuse and glossy scenes. Our method builds on pre-convolved radiance caching (RC), which enables reusing the incident radiance computed at a surface point for its neighborhood. Our contributions include efficient and robust generation of these RCs based on a pre-filtered voxel representation that stores scene-geometry and sur...
متن کاملData Structures for Interpolation of Illumination with Radiance and Irradiance Caching
Irradiance and radiance caching are important algorithms for solving the light transport problem in realistic image synthesis. ey both require geometric search data structures for efficient rendering. Our goal was to improve the caching algorithms by improving these data structures. We have implemented 6 different data structures for irradiance caching, 2 previously used and 4 newly adapted to...
متن کاملSpatial Directional Radiance Caching
We present a new approach for accelerated global illumination computation in scenes with glossy surfaces. Our algorithm combines sparse illumination computation used in the radiance caching algorithm with BRDF importance sampling. To make this approach feasible, we extend the idea of lazy illumination evaluation, used in the caching approaches, from the spatial to the directional domain. Using ...
متن کاملAnisotropic Radiance-Cache Splatting for Efficiently Computing High-Quality Global Illumination with Lightcuts
Computing global illumination in complex scenes is even with todays computational power a demanding task. In this work we propose a novel irradiance caching scheme that combines the advantages of two state-of-the-art algorithms for high-quality global illumination rendering: lightcuts, an adaptive and hierarchical instant-radiosity based algorithm and the widely used (ir)radiance caching algori...
متن کاملNormal Mapping for Precomputed Radiance Transfer (NMPRT)
Normal mapping is a variant of bump mapping that is commonly used in computer games. It models complex surface variations by explicitly storing a surface normal in a texture map. However, it has not been used with precomputed radiance transfer (PRT), a technique for modeling an object’s response to a parameterized model of lighting, which enables interactive rendering of complex global illumina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 31 شماره
صفحات -
تاریخ انتشار 2012